Syntax and Variable Binding
نویسندگان
چکیده
Syntax and Variable Binding (Extended Abstract) Marcelo Fiore COGS Univ. of Sussex Gordon Plotkin LFCS Univ. of Edinburgh Daniele Turi∗ LFCS Univ. of Edinburgh
منابع مشابه
Abstract Syntax and Variable Binding
Syntax and Variable Binding (Extended Abstract) Marcelo Fiore COGS Univ. of Sussex Gordon Plotkin LFCS Univ. of Edinburgh Daniele Turi LFCS Univ. of Edinburgh
متن کاملVariable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
This paper investigates the use of symmetric monoidal closed (smc) structure for representing syntax with variable binding, in particular for languages with linear aspects. In this setting, one first specifies an smc theory T , which may express binding operations, in a way reminiscent from higher-order abstract syntax (hoas). This theory generates an smc category S(T ) whose morphisms are, in ...
متن کاملFoolProof: A Component Toolkit for Abstract Syntax with Variable Bindings
FOOLPROOF is intended as a component toolkit for implementation of formal languages with binding structures. It provides a coherent collection of components for many common language processing tasks, in particular those related to binding structures. FOOLPROOF consists of: a meta-language for specifying signatures with variable bindings; a signature editor for constructing well-formed signature...
متن کاملSubstitution in non-wellfounded syntax with variable binding
Inspired from the recent developments in theories of non-wellfounded syntax (coinductively defined languages) and of syntax with binding operators, the structure of algebras of wellfounded and non-wellfounded terms is studied for a very general notion of signature permitting both simple variable binding operators as well as operators of explicit substitution. This is done in an extensional math...
متن کاملPolymorphic Abstract Syntax via Grothendieck Construction
Abstract syntax with variable binding is known to be characterised as an initial algebra in a presheaf category. This paper extends it to the case of polymorphic typed abstract syntax with binding. We consider two variations, secondorder and higher-order polymorphic syntax. The central idea is to apply Fiore’s initial algebra characterisation of typed abstract syntax with binding repeatedly, i....
متن کامل